package algorithm;

import java.util.Scanner;

/**
 *  线性阶 - O(n)
 */
public class Demo5 {
    public static void main(String[] args) {
        int i;
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for(i = 0; i < n; i++) {
            // 时间复杂度为 O(1) 的程序步骤序列
        }
    }
}
